More on Result Involution Graphs

نویسندگان

چکیده

The result involution graph of a finite group , denoted by is an undirected simple whose vertex set the whole and two distinct vertices are adjacent if their product element. In this paper, graphs for all Mathieu groups connectivity in studied. diameter, radius girth also Furthermore, several other properties obtained.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Equienergetic Signed Graphs

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...

متن کامل

MORE ON EDGE HYPER WIENER INDEX OF GRAPHS

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

متن کامل

Commuting Involution Graphs for Ãn

Let G be a group and X a subset of G. The commuting graph on X, denoted C(G,X), has vertex set X and an edge joining x, y ∈ X whenever xy = yx. If in addition X is a set of involutions, then C(G,X) is called a commuting involution graph. Commuting graphs have been investigated by many authors. Sometimes they are tools used in the proof of a theorem, or they may be studied as a way of shedding l...

متن کامل

On Pi-Product Involution Graphs in Symmetric Groups

Suppose that G is a group, X a subset of G and π a set of natural numbers. The π-product graph Pπ(G,X) has X as its vertex set and distinct vertices are joined by an edge if the order of their product is in π. If X is a set of involutions, then Pπ(G,X) is called a π-product involution graph. In this paper we study the connectivity and diameters of Pπ(G,X) when G is a finite symmetric group and ...

متن کامل

On π-Product Involution Graphs in Symmetric Groups

Suppose that G is a group, X a subset of G and π a set of natural numbers. The π-product graph Pπ(G,X) has X as its vertex set and distinct vertices are joined by an edge if the order of their product is in π. If X is a set of involutions, then Pπ(G,X) is called a π-product involution graph. In this paper we study the connectivity and diameters of Pπ(G,X) when G is a finite symmetric group and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iraqi journal of science

سال: 2023

ISSN: ['0067-2904', '2312-1637']

DOI: https://doi.org/10.24996/ijs.2023.64.1.30